Minimizing Metro Transfer Waiting Time with AFCS Data Using Simulated Annealing with Parallel Computing
نویسندگان
چکیده
منابع مشابه
Public transport fleet scheduling for minimizing total transfer waiting time
Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....
متن کاملAlgorithm Mapping with Parallel Simulated Annealing Algorithm Mapping with Parallel Simulated Annealing ?
This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...
متن کاملVectorizing Image Outlines using Spline Computing Approaches with Simulated Annealing
This paper is an overview of three spline approaches of degree one, two and three. It represents the review and comparative study of Linear, conic and cubic splines for the vectorization of outlines of the planar images. It has various phases including extracting outlines of images, detecting corner points from the detected outlines, and curve fitting. The idea of simulated annealing has been i...
متن کاملTemperature Parallel Simulated Annealing with Adaptive Neighborhood
In this paper, a Temperature Parallel Simulated Annealing with Adaptive Neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Transportation
سال: 2018
ISSN: 0197-6729,2042-3195
DOI: 10.1155/2018/4218625